Weakly Monotonic Propagators
نویسندگان
چکیده
Today’s models for propagation-based constraint solvers require propagators as implementations of constraints to be at least contracting and monotonic. These models do not comply with reality: today’s constraint programming systems actually use non-monotonic propagators. This paper introduces the first realistic model of constraint propagation by assuming a propagator to be weakly monotonic (complying with the constraint it implements). Weak monotonicity is shown to be the minimal property that guarantees constraint propagation to be sound and complete. The important insight is that weak monotonicity makes propagation in combination with search well behaved. A case study suggests that non-monotonicity can be seen as an opportunity for more efficient propagation.
منابع مشابه
A Sequence of Weakly Monotonic Automata with Increasing Level
In this paper, we exhibit a sequence of strongly connected aperiodic weakly monotonic automata, whose level increases with the number of states. Mathematics Subject Classification: 20M35, 68Q45, 20M07
متن کاملA Constructive Analysis of Convex-Valued Demand Correspondence for Weakly Uniformly Rotund and Monotonic Preference
Bridges 1992 has constructively shown the existence of continuous demand function for consumers with continuous, uniformly rotund preference relations. We extend this result to the case of multivalued demand correspondence. We consider a weakly uniformly rotund and monotonic preference relation and will show the existence of convex-valued demand correspondence with closed graph for consumers wi...
متن کاملNear Optimal Non-truthful Auctions
In several e-commerce applications, non-truthful auctions have been preferred over truthful weakly dominant strategy ones partly because of their simplicity and scalability. Although nontruthful auctions can have weaker incentive constraints than truthful ones, the question of how much more revenue they can generate than truthful auctions is not well understood. We study this question for natur...
متن کاملMonotonic -equilibria in strongly symmetric games
-equilibrium allows for worse actions to be played with higher probability than better actions. I introduce a refinement that addresses this shortcoming: an -equilibrium is monotonic if each player assigns (weakly) higher probabilities to better actions. This concept is logically independent of strong -equilibrium. I study these refinements of -equilibrium in games with countably many players a...
متن کاملWeakly Monotone Averaging Functions
Monotonicity with respect to all arguments is fundamental to the definition of aggregation functions. It is also a limiting property that results in many important non-monotonic averaging functions being excluded from the theoretical framework. This work proposes a definition for weakly monotonic averaging functions, studies some properties of this class of functions and proves that several fam...
متن کامل